Sequential Equivalence Checking with Efficient Filtering Strategies for Inductive Invariants
نویسنده
چکیده
منابع مشابه
Cut-Based Inductive Invariant Computation
This paper presents a new way of computing inductive invariants in sequential designs. The invariants are useful for strengthening inductive proofs in difficult unbounded model checking instances. Candidate invariants are derived from a set of m-feasible cuts in the logic network and proved by induction. Thus, the proposed computation is very scalable, and it is possible to flexibly trade compu...
متن کاملFormal Modeling and Verification of Interlocking Systems Featuring Sequential Release
In this paper, we present a method and an associated tool suite for formal verification of the new ETCS level 2 based Danish railway interlocking systems. We have made a generic and reconfigurable model of the system behavior and generic high-level safety properties. This model accommodates sequential release – a feature in the new Danish interlocking systems. The generic model and safety prope...
متن کاملUsing Speculation for Sequential Equivalence Checking
An improved method for speculative reduction is proposed and applied to (suspected) hard verification problems. Several variations of the algorithm were tested: (a) applying speculation initially to the original problem; (b) applying speculation after simplification, before our regular model checker, super_prove is applied, as well as (c) using different filters to reduce the number of speculat...
متن کاملm-Inductive Property of Sequential Circuits
Abstract—This paper introduces m-inductiveness over a set of nodes S in sequential circuits. The m-inductive property can be used for equivalence-checking or improved sequential optimization. It allows the behavior of many next-state functions (not in S) to be changed while maintaining correctness at the primary outputs of a circuit. As such, it creates flexibility that can be used for sequen...
متن کاملIncremental Sequential Equivalence Checking and Subgraph Isomorphism
A method for finding large isomorphic subgraphs in two similar circuits is proposed, and its application to sequential equivalence checking (SEC) is discussed. SEC ensures correctness of two designs. Among other things, efficient SEC is important for wider adoption of innovative sequential synthesis (SS) methods, which offer substantial reductions in delay, area, power and flip-flop counts, com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011